Sequence Randomization Using Convolutional Codes and Probability Functions
نویسنده
چکیده
This paper investigates the use of different transformations for improving the randomness of sequences. In particular, convolutional codes are used for increasing the size of a given sequence and then a random mapping function is used for further randomization. We have shown how such a method can convert highly correlated sequences into random ones.
منابع مشابه
Using Convolutional Codes for Key Extraction in Physical Unclonable Functions
Physical Unclonable Functions (PUFs) exploit variations in the manufacturing process to derive bit sequences from integrated circuits, which can be used as secure cryptographic keys. Instead of storing the keys in an insecure, non-volatile memory, they can be reproduced when needed. Since the reproduced sequences are not stable due to physical reasons, error correction must be applied. Recently...
متن کاملDistance Spectrum of Channel Trellis Codes on Precoded Partial-response 1-d Channel
Distance spectrum is the main factor in determining the event error probability when maximum-likelihood decoding is used for convolutional codes [13]. In this paper we compute the distance spectrum for the best R=1/N channel codes obtained using convolutional (linear trellis) codes together with known offset sequence addition on precoded partial-response 1−D channel proposed in [4]. To this end...
متن کاملBLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE
This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...
متن کاملHybrid Concatenated Codes and Iterative Decoding
A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...
متن کاملA search for good convolutional codes to be used in the construction of turbo codes
Recursive systematic convolutional encoders have been shown to play a crucial role in the design of turbo codes. We recall some properties of binary convolutional encoders and apply them to a search for good constituent convolutional codes of turbo codes. Tables of the “best” recursive systematic convolutional encoders found are presented for various rates, together with the average bit-error p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1208.5746 شماره
صفحات -
تاریخ انتشار 2012